Excellent Domination in Fuzzy Graphs

نویسندگان

  • K. M. Dharmalingam
  • P. Nithya
چکیده

Let G be a fuzzy graph. A subset D of V is said to be Fuzzy dominating set if every vertex u ∈ V (G) there exists a vertex v ∈ V −D such that uv ∈ E(G) and μ(uv) 6 σ(u) ∧ σ(v). The minimum Cardinality of fuzzy dominating set is denoted by γf . A graph G is said to be fuzzy excellent if every vertex of G belongs to γf -sets of G. In this paper, we give a construction to imbedded non-excellent fuzzy graph G in an excellent fuzzy graph H such that γf (H) 6 γf (G) + 2. We also show that for a given non-excellent fuzzy graph G, there is subdivision of G which is fuzzy excellent. Also, we introduce the concept of γf -flexible, fuzzy bridge independent dominating number γ bi and obtain some interesting results for this new parameter in excellent fuzzy graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coverings, matchings and paired domination in fuzzy graphs using strong arcs

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

متن کامل

Roman domination excellent graphs: trees

A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...

متن کامل

Connected domination in fuzzy graphs using strong arcs

Abstract. In this paper, connected domination in fuzzy graphs using strong arcs is introduced. The strong connected domination number of different classes of fuzzy graphs is obtained. An upper bound for the strong connected domination number of fuzzy graphs is obtained. Strong connected domination in fuzzy trees is studied. It is established that the set of fuzzy cut nodes of a fuzzy tree is a ...

متن کامل

Edge Domination in Intuitionistic Fuzzy Graphs

In this paper we introduce the concept of edge domination and total edge domination in intuitionistic fuzzy graphs. We determine the edge domination number and total edge domination number for several classes of intuitionistic fuzzy graphs and obtain bounds for them. We also obtain Nordhaus gaddum type results for the parameters.

متن کامل

Total Domination in Fuzzy Graphs Using Strong Arcs

In this paper we introduce the concept of strong total domination in fuzzy graphs. We determine the strong total domination number for several classes of fuzzy graphs. A lower bound and an upper bound for the strong total domination number in terms of strong domination number is obtained. Strong total domination in fuzzy trees is studied. A necessary and sufficient condition for the set of fuzz...

متن کامل

Non Split Domination on Intuitionistic Fuzzy Graphs

A dominating set D of an IFG G = (V, E) is a non-split dominating set, if the induced intuitionistic fuzzy subgraph 〈ܸ − ‫〉ܦ‬ is connected. The Non-split domination number ߛ ௡௦ ሺ‫ܩ‬ሻ of IFG G is the minimum cardinality of all Non-split dominating set. In this paper we study some theorems in Non-split dominating sets of IFG and some results of ߛ ௡௦ ሺ‫ܩ‬ሻwith other known parameters of IFG G. 1. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016